Multidimensional Elastic Pattern Matching
نویسندگان
چکیده
In this paper, we present a theory of elastic images deformation and matching. Our theory is based on the physical theory of elastic deformation of a continuum, and is very general: it applies to matching n-dimensional images with n-dimensional templates. We derive the variational formulation of the optimal deformation problem, and the Euler-Lagrange equations to solve it. Also, we address the issue of invariance of matching with respect to a given transformation group. We use the Noether's theorem from mathematical physics to show that invariance with respect to an arbitrary transformation group|more properly: to its Lie algebra|can be \built in" the elastic properties of the template. Finally, we discuss the numerical solution of the Euler-Lagrange equation. We rst show that, under suitable hypotheses, the optimal solution can be obtained as the linear combination of a nite number of basis functions.
منابع مشابه
Morphological elastic graph matching applied to frontal face authentication under well-controlled and real conditions
In this paper, morphological elastic graph matching is applied to frontal face authentication on databases ranging from small to large multimedia ones collected under either well-controlled or real-world conditions. It is shown that the morphological elastic graph matching achieves a very low equal error rate on databases collected under well-controlled conditions. However, its performance dete...
متن کاملMultidimensional Pattern Matching: A Survey
We review some recent algorithms motivated by computer vision. The problem inspiring this research is that of searching an aerial photograph for all appearances of some object. The issues we discuss are local errors, scaling, compression and dictionary matching. We review deterministic serial techniques that are used for multidimensional pattern matching and discuss their strengths and weaknesses.
متن کاملEfficient Pattern Matching in Elastic-Degenerate Strings
In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such that each elastic-degenerate symbol corresponds to a set of two or more variable length strings. Here, we present an algorithm for solving the pattern matchi...
متن کاملPattern Matching in Multidimensional Time Series
Based on the algorithm for pattern matching in a character string, a pattern description language (PDL) is developed. The compilation of a regular expression, that conforms to the PDL, creates a nondeterministic pattern matching machine (PMM) that can be used as a searching device for detecting sequential patterns or functional (statistical) relationships in multidimensional data. As an example...
متن کاملFingerprint matching by thin-plate spline modelling of elastic deformations
This paper presents a novel minutiae matching method that describes elastic distortions in 4ngerprints by means of a thin-plate spline model, which is estimated using a local and a global matching stage. After registration of the 4ngerprints according to the estimated model, the number of matching minutiae can be counted using very tight matching thresholds. For deformed 4ngerprints, the algori...
متن کامل